Symmetric motifs in random geometric graphs
نویسندگان
چکیده
منابع مشابه
Infinite Random Geometric Graphs
We introduce a new class of countably infinite random geometric graphs, whose vertices V are points in a metric space, and vertices are adjacent independently with probability p ∈ (0, 1) if the metric distance between the vertices is below a given threshold. If V is a countable dense set in R equipped with the metric derived from the L∞-norm, then it is shown that with probability 1 such infini...
متن کاملDynamic Random Geometric Graphs
We provide the first analytical results for the connectivity of dynamic random geometric graphs-a model of mobile wireless networks in which vertices move in random (and periodically updated) directions, and an edge exists between two vertices if their Euclidean distance is below a given threshold. We provide precise asymptotic results for the expected length of the connectivity and disconnecti...
متن کاملRandom geometric graphs.
We analyze graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality and only edges between adjacent points are present. The critical connectivity is found numerically by examining the size of the largest cluster. We derive an analytical expression for the cluster coefficient, which shows that the graphs are distinctly different from standard ra...
متن کاملGeometric Inhomogeneous Random Graphs
For the theoretical study of real-world networks, we propose a model of scale-free randomgraphs with underlying geometry that we call geometric inhomogeneous random graphs (GIRGs).GIRGs generalize hyperbolic random graphs, which are a popular model to test algorithms forsocial and technological networks. Our generalization overcomes some limitations of hyperbolicrandom graphs, w...
متن کاملColouring random geometric graphs
A random geometric graph Gn is obtained as follows. We takeX1, X2, . . . , Xn ∈ R at random (i.i.d. according to some probability distribution ν on R). For i 6= j we joinXi andXj by an edge if ‖Xi−Xj ‖< r(n). We study the properties of the chromatic number χn and clique number ωn of this graph as n becomes large, where we assume that r(n) → 0. We allow any choice ν that has a bounded density fu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complex Networks
سال: 2017
ISSN: 2051-1310,2051-1329
DOI: 10.1093/comnet/cnx022